On-line algorithms for networks of temporal constraints
نویسندگان
چکیده
منابع مشابه
On-Line Algorithms for Networks of Temporal Constraints
We consider a semi-dynamic setting for the Temporal Constraint Satisfaction Problem, where we are requested to maintain the path-consistency of a network under a sequence of insertions of new (further) constraints between pairs of variables. We show how to maintain path-consistent a network in the deened setting in O(nR 3) amortized time on a sequence of (n 2) insertions, where n is the number ...
متن کاملEecient Algorithms for Networks of Quantitative Temporal Constraints
This paper describes two algorithms for networks of quantitative temporal constraints. The rst one is an incremental algorithm for checking the consistency of a set of constraints: it is based on the directional path consistency property, and it is a complete algorithm. The second algorithm relies on a property of shortest paths in a directional path consistent network. We prove this property a...
متن کاملBacktracking Algorithms for Disjunctions of Temporal Constraints
We extend the framework of simple temporal problems studied originally by Dechter, Meiri and Pearl to consider constraints of the form x1 − y1 6 r1 ∨ · · · ∨ xn − yn 6 rn, where x1, . . . , xn, y1, . . . , yn are variables ranging over the real numbers, r1, . . . , rn are real constants, and n> 1. This is a wide class of temporal constraints that can be used to model a variety of problems in te...
متن کاملIncremental Algorithms for Managing Temporal Constraints
This paper addresses the problem of eeciently updating a network of temporal constraints when constraints are removed from or added to an existing network. Such processing tasks are important in many AI applications requiring a temporal reasoning module. First we analyze the relationship between shortest-paths algorithms for directed graphs and arc-consistency techniques. Then we focus on a sub...
متن کاملEvaluating Consistency Algorithms for Temporal Metric Constraints
We study the performance of some known algorithms for solving the Simple Temporal Problem (STP) and the Temporal Constraint Satisfaction Problem (TCSP). In particular, we empirically compare the Bellman-Ford (BF) algorithm and its incremental version (incBF) by (Cesta & Oddi 1996) to the 4STP of (Xu & Choueiry 2003a). Among the tested algorithms, we show that 4STP is the most efficient for dete...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Discrete Algorithms
سال: 2003
ISSN: 1570-8667
DOI: 10.1016/s1570-8667(03)00031-5